Independence Detection for Multi-Agent Pathfinding Problems
نویسنده
چکیده
Problems that require multiple agents to follow noninterfering paths from their current states to their respective goal states are called multi-agent pathfinding problems (MAPFs). In previous work, we presented Independence Detection (ID), an algorithm for breaking a large MAPF problem into smaller problems that can be solved independently. Independence Detection is complete and can be used in combination with both optimal and approximation algorithms. This paper serves as an introduction to Independence Detection and aims to clarify its details.
منابع مشابه
Independence Detection in SAT-based Multi-Agent Path Finding
The problem of optimal multi-agent path finding (MAPF) is addressed in this paper. The task is to find optimal paths for mobile agents where each of them need to reach a unique goal position from the given start with respect to the given objective function. Agents must not collide with each other which is a source of combinatorial difficulty of the problem. An abstraction of the problem where d...
متن کاملA Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding
Multi-agent pathfinding, where multiple agents must travel to their goal locations without getting stuck, has been studied in both theoretical and practical contexts, with a variety of both optimal and sub-optimal algorithms proposed for solving problems. Recent work has shown that there is a lineartime check for whether a multi-agent pathfinding problem can be solved in a tree, however this wa...
متن کاملFinding Optimal Solutions to Cooperative Pathfinding Problems
In cooperative pathfinding problems, non-interfering paths that bring each agent from its current state to its goal state must be planned for multiple agents. We present the first practical, admissible, and complete algorithm for solving problems of this kind. First, we propose a technique called operator decomposition, which can be used to reduce the branching factors of many search algorithms...
متن کاملNon-Optimal Multi-Agent Pathfinding Is Solved (Since 1984)
Optimal solutions for multi-agent pathfinding problems are often too expensive to compute. For this reason, suboptimal approaches have been widely studied in the literature. Specifically, in recent years a number of efficient suboptimal algorithms that are complete for certain subclasses have been proposed at highly-rated robotics and AI conferences. However, it turns out that the problem of no...
متن کاملBiased Cost Pathfinding
In this paper we introduce the Biased Cost Pathfinding (BCP) algorithm as a simple yet effective meta algorithm that can be fused with any other single agent search method in order to make it usable in multi-agent environments. In particular, we focus on pathfinding problems common in real-time strategy games where units can have different functions and mission priorities. We evaluate BCP paire...
متن کامل